Background Knowledge in Schema Matching: Strategy vs. Data
نویسندگان
چکیده
The use of external background knowledge can be beneficial for the task matching schemas or ontologies automatically. In this paper, we exploit six general-purpose graphs as sources task. are evaluated by applying three different exploitation strategies. We find that explicit strategies still outperform latent ones and choice strategy has a greater impact on final alignment than actual dataset which is applied. While could not identify universally superior resource, BabelNet achieved consistently good results. Our best matcher configuration with performs very competitively when compared to other systems even though no dataset-specific optimizations were made.
منابع مشابه
Background Knowledge in Ontology Matching
Ontology matching is a critical operation in many well-known metadata intensive applications, such as data integration and peer-to-peer information sharing. Typically, heterogeneity in these applications is reduced in two steps: (i) matching ontologies to determine correspondences and (ii) executing correspondences according to an application needs (e.g., data translation). In this position sta...
متن کاملDesigning a Knowledge-based Schema Matching System for Schema Mapping
Schema mapping that provides a unified view to the users is necessary to manage schema heterogeneity among different data sources. Schema matching is a required task for schema mapping that finds semantic correspondences between entity pairs of schemas. Semi-automatic schema matching systems were developed to overcome manual works for schema mapping. However, such approaches require a high manu...
متن کاملAutomated matching of data mining dataset schemata to background knowledge
Interoperability in data mining is supported by a standard for dataset and model representation: Predictive Model Markup Language (PMML).1 It allows to describe the columns (which are continuous, categorical or ordinal) of the source data table, preprocessing transformations (such as discretization of continuous values) as well as the structure of the discovered model (e.g. neural network or se...
متن کاملDiscovering Missing Background Knowledge in Ontology Matching
Semantic matching determines the mappings between the nodes of two graphs (e.g., ontologies) by computing logical relations (e.g., subsumption) holding among the nodes that correspond semantically to each other. We present an approach to deal with the lack of background knowledge in matching tasks by using semantic matching iteratively. Unlike previous approaches, where the missing axioms are m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-88361-4_17